A block-iterative quadratic signal recovery algorithm
نویسنده
چکیده
We propose a block-iterative parallel decomposition method to solve quadratic signal recovery problems under convex constraints. The idea of the method is to disintegrate the original multi-constraint problem into a sequence of simple quadratic minimizations over the intersection of two half-spaces constructed by linearizing blocks of constraints. The implementation of the algorithm is quite exible thanks to its block-parallel structure. In addition a wide range of complex constraints can be incorporated since the method does not require exact constraint enforcement at each step but merely approximate enforcement via linearization. An application to deconvolution is demonstrated.
منابع مشابه
A block-iterative surrogate constraint splitting method for quadratic signal recovery
A block-iterative parallel decomposition method is proposed to solve general quadratic signal recovery problems under convex constraints. The proposed method proceeds by local linearizations of blocks of constraints and it is therefore not sensitive to their analytical complexity. In addition, it naturally lends itself to implementation on parallel computing architectures due to its flexible bl...
متن کاملISAR Imaging Based on Iterative Reweighted Lp Block Sparse Reconstruction Algorithm
Sparse signal recovery algorithms can be used to improve radar imaging quality by using the sparse property of strong scatterers. Traditional sparse inverse synthetic aperture radar (ISAR) imaging algorithms mainly consider the recovery of sparse scatterers. However, the scatterers of an ISAR target usually exhibit block or group sparse structure. By utilizing the inherent block sparse structur...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملSample-Efficient Algorithms for Recovering Structured Signals from Magnitude-Only Measurements
We consider the problem of recovering a signal x∗ ∈ R, from magnitude-only measurements, yi = |〈ai,x〉| for i = {1, 2, . . . ,m}. This is a stylized version of the classical phase retrieval problem, and is a fundamental challenge in nanoand bio-imaging systems, astronomical imaging, and speech processing. It is well known that the above problem is ill-posed, and therefore some additional assumpt...
متن کاملRecovering Sparse Low-rank Blocks in Mass Spectrometry∗
We develop a novel sparse low-rank block (SLoB) signal recovery framework that simultaneously exploits sparsity and low-rankness to accurately identify peptides (fragments of proteins) from biological samples via tandem mass spectrometry (TMS). To efficiently perform SLoB-based peptide identification, we propose two novel recovery algorithms, an exact iterative method and an approximate greedy ...
متن کامل